The Capacitated Transshipment Location Problem under Uncertainty

نویسندگان

  • Roberto Tadei
  • Guido Perboli
  • Nicoletta Ricciardi
چکیده

We consider the stochastic capacitated transshipment problem for freight transportation where an optimal location of the transshipment facilities, which minimizes the total cost, must be found. The total cost is given by the sum of the total fixed cost plus the expected minimum total flow cost, when the throughput costs of the facilities are random variables with unknown probability distribution. By applying the asymptotic approximation method derived from the extreme value theory, a deterministic nonlinear model, which belongs to a wide class of Entropy maximizing models, is then obtained. The computational results show a very good performance of this deterministic model when compared to the stochastic one.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lagrangian Heuristic for the Capacitated Transshipment Location Problem under Uncertainty

We want to find a location of capacitated transshipment facilities which minimizes the expected total cost when the generalized transportation costs are random variables. Each generalized transportation cost is given by the sum of a deterministic transportation cost and a random transshipment facility throughput cost, whose probability distribution is unknown. A two-stage stochastic program wit...

متن کامل

A Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

متن کامل

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

متن کامل

A Single Machine Capacitated Production Planning Problem Under Uncertainty: A Grey Linear Programming Approach

The production planning is an important problem in most of manufacturing systems in practice. Unlike many researches existing in literature, this problem encounters with great uncertainties in parameters and input data. In this paper, a single machine capacitated production planning problem is considered and a linear programming formulation is presented. The production costs are assumed to be u...

متن کامل

Modeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)

The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009